Three-Dimension Hamiltonian Broadcast Wormhole-Routing
نویسندگان
چکیده
منابع مشابه
Near-Optimal Broadcast in All-Port Wormhole-Routed 3D Tori with Dimension-Ordered Routing
The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper, we study this problem in a wormhole-routed 3D torus which provides the dimension-ordered routing and the all-port communication capability. We propose an efficient scheme to utilize the distance-insensitive characteristic of wormhole routing. The scheme requires at most 4 steps more than the optima...
متن کاملWormhole Hamiltonian Monte Carlo
In machine learning and statistics, probabilistic inference involving multimodal distributions is quite difficult. This is especially true in high dimensional problems, where most existing algorithms cannot easily move from one mode to another. To address this issue, we propose a novel Bayesian inference approach based on Markov Chain Monte Carlo. Our method can effectively sample from multimod...
متن کاملUniversal Wormhole Routing
In this paper, we examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O (cdη + cLη logP ) time with high probability, where L is the number of flits in a packet, and η = min {d, L}; only a constant number of flits are stored...
متن کاملWormhole Routing in Parallel Computers
In order to offer low communication latency and reduced buffer requirements, wormhole routing has been used in almost all new generation parallel computers. It has been a powerful switching technique where its communication latency is distance insensitive. On the other hand, deadlock avoidance is the most critical issue in wormhole networks. If deadlock handling is not considered, wormhole rout...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2015
ISSN: 0975-2293,0974-9322
DOI: 10.5121/ijcnc.2015.7303